Computing Approximate Blocking Probabilities in Wavelength Routed All-Optical Networks with Limited- - INFOCOM '99. Eighteenth Annual Joint Conference of the IEEE Computer and Communications Societies
نویسنده
چکیده
Absfrcrcf-In this paper, we propose a method to calculate the average blocking probability in all-optical networks using limited-rmge wavelength conversion. Previous works have shown that there is a remarkable improvement in blocking probability while using limited-range wavelength conversion [2], [3] but these analytical models were either for a path [2] or for a mesh-torus network [3]. Using a graph-theoretical approach, we extend Birman’s model [4] for no wavelength conversion and derive an analytical expression to compute the blocking probabilities in networks with limited-range wavelength conversion for fixed routing. The proposed analytical model is a generalization of Birman’s model and is applicable to m y network topology. We consider the case where an incoming wavelength can be converted to d adjacent outgoing wavelengths on either side of the input wavelength, in addition to the input wavelength itself, where d is the degree of conversion. Using this model we demonstrate that the performance improvement obtained by full wavelength conversion over no wavelength conversion can almost he achieved by using limited wavelength conversion with the degree of conversion, d, being only 1 or 2. In a few example networks we considered, for blocking probabilities up to a few percent, the carried traffic with limited conversion degree d = 2 was almost equal to the carried traffic for full wavelength conversion. The results obtained show that significant improvements in blocking performance can be obtained by providing limited-range wavelength conversion of small degree within the network.
منابع مشابه
Computing approximate blocking probabilities for a class of all-optical networks - INFOCOM '95. Fourteenth Annual Joint Conference of the IEEE Computer and Communications Societies
W e study a class of all-optical networks using wavelength division multiplexing and wavelength routing in which a connection between a pair of nodes in the network is assigned a path and a wavelength o n that path. Moreover, o n the links of that path n o other connection can share the assigned wavelength. Using a generalized reduced load approximation scheme we calculate the blocking probabil...
متن کاملComputing Approximate Blocking Probabilities for a Class of All-Optical Networks
We study a class of all-optical networks using wavelength division multiplexing and wavelength routing in which a connection between a pair of nodes in the network is assigned a path and a wavelength on that path. Moreover, on the links of that path no other connection can share the assigned wavelength. Using a generalized reduced load approximation scheme we calculate the blocking probabilitie...
متن کاملMultiwavelength Optical Networks With Limited Wavelength Conversion - INFOCOM '97. Sixteenth Annual Joint Conference of the IEEE Computer and Communications Societies.
This paper proposes optical wavelength division multiplexed (WDM) networks with limited wavelength conversion that can eficiently support lightpaths (connections) between nodes. Each lightpath follows a route in the network and must be assigned a channel along each link in its route. The load A , , , of a set of lightpath requests is the maximum over al l links of the number of lightpaths that ...
متن کاملResource Allocation in a Multicast Tree - INFOCOM '99. Eighteenth Annual Joint Conference of the IEEE Computer and Communications Societies
We consider how to allocate bandwidth in a multicast tree so as to optimize some global measure of performance. In our model each receiver has a budget to be used for bandwidth reservation on links along its path from the source, and each link has a cost function depending on the amount of total bandwidth resewed at the link by all receivers using that link We formulate and solve a problem of a...
متن کاملMulticast Session Membership Size Estimation - INFOCOM '99. Eighteenth Annual Joint Conference of the IEEE Computer and Communications Societies
AbsfructWe derive estimators and bounds that drive probabilistic polling algorithms for the estimation of the session size, n, of any.potentially large scale multicast session. We base our analysis upon a mapping of polling mechanisms to the problem of estimating the parameter n of the binomial ( n , p ) distribution. From the binomial model, we derive an interval estimator for n, and we charac...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
دوره شماره
صفحات -
تاریخ انتشار 2004